Solovay-Kitaev decomposition strategy for single-qubit channels.

نویسندگان

  • Dong-Sheng Wang
  • Dominic W Berry
  • Marcos C de Oliveira
  • Barry C Sanders
چکیده

Inspired by the Solovay-Kitaev decomposition for approximating unitary operations as a sequence of operations selected from a universal quantum computing gate set, we introduce a method for approximating any single-qubit channel using single-qubit gates and the controlled-not (cnot). Our approach uses the decomposition of the single-qubit channel into a convex combination of "quasiextreme" channels. Previous techniques for simulating general single-qubit channels would require as many as 20 cnot gates, whereas ours only needs one, bringing it within the range of current experiments.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A State Distillation Protocol to Implement Arbitrary Single-qubit Rotations

An important task required to build a scalable, fault-tolerant quantum computer is to efficiently represent an arbitrary single-qubit rotation by fault-tolerant quantum operations. Traditionally, the method for decomposing a single-qubit unitary into a discrete set of gates is Solovay-Kitaev decomposition, which in practice produces a sequence of depth O(log(1/ )), where c ∼ 3.97 is the state-o...

متن کامل

The Solovay-Kitaev algorithm

This pedagogical review presents the proof of the Solovay-Kitaev theorem in the form of an efficient classical algorithm for compiling an arbitrary single-qubit gate into a sequence of gates from a fixed and finite set. The algorithm can be used, for example, to compile Shor's algorithm, which uses rotations of π/2 k , into an efficient fault-tolerant form using only Hadamard, controlled-not, a...

متن کامل

A Depth-Optimal Canonical Form for Single-qubit Quantum Circuits

Given an arbitrary single-qubit operation, an important task is to efficiently decompose this operation into an (exact or approximate) sequence of fault-tolerant quantum operations. We derive a depth-optimal canonical form for single-qubit quantum circuits, and the corresponding rules for exactly reducing an arbitrary single-qubit circuit to this canonical form. We focus on the singlequbit univ...

متن کامل

Asymptotically optimal approximation of single qubit unitaries by Clifford and T circuits using a constant number of ancillary qubits

Decomposing unitaries into a sequence of elementary operations is at the core of quantum computing. Information theoretic arguments show that approximating a random unitary with precision ε requires Ω(log(1/ε)) gates. Prior to our work, the state of the art in approximating a single qubit unitary included the Solovay-Kitaev algorithm that requires O(log(3+δ)(1/ε)) gates and does not use ancilla...

متن کامل

Universality of single quantum gates

σz = 1 0 0 −1 basis. We treat the 2-qubit Swap gate ↑↑ ↑↓ ↓↑ ↓↓ ↑↑ 1 0 0 0 ↑↓ 0 0 1 0 ↓↑ 0 1 0 0 ↓↓ 0 0 0 1 as inherent to the circuit model, i.e. the timelines of qubits can be permuted. Thus, for example, a given 2-qubit gate can always be applied to any pair of qubits and in either order. The proof of “universality” of a given set of gates, i.e. universality for the class BQP (polynomial tim...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Physical review letters

دوره 111 13  شماره 

صفحات  -

تاریخ انتشار 2013